Graph coloring

Results: 948



#Item
81Graph theory / Graph coloring / Rainbow coloring / Edge coloring

Rainbow copies of C4 in edge-colored hypercubes J. Balogh ∗ M. Delcourt

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:16
82Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Vertex cover / Clique / Degree / Connectivity / Independent set / Graph coloring

Microsoft Wordtext.nativedoc

Add to Reading List

Source URL: web.uvic.ca

Language: English - Date: 2012-11-03 03:43:42
83Computational complexity theory / Theory of computation / Mathematics / Complexity classes / Analysis of algorithms / Graph coloring / Theoretical computer science / Algorithm / NP / Time complexity / Greedy algorithm / P

fea-mcgeoch.qxp:58 AM

Add to Reading List

Source URL: www.ams.org

Language: English - Date: 2001-02-16 13:50:35
84Graph theory / Morphisms / Graph operations / NP-complete problems / Graph coloring / Graph homomorphism / Graph isomorphism / Pathwidth / Hypergraph / Treewidth / Cograph / Graph

Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2012-06-12 14:31:34
85Mathematics / Graph theory / Computational complexity theory / NP-complete problems / Subgraph isomorphism problem / Graph isomorphism / Matching / Graph / Vertex / Induced subgraph isomorphism problem / Graph coloring

Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France

Add to Reading List

Source URL: bpm2005.loria.fr

Language: English - Date: 2005-09-12 10:45:10
86Graph theory / NP-complete problems / Graph coloring / Triangle-free graph / Treewidth / Independent set / Planar graph / Line graph / Perfect graph / Dominating set / Clique cover / Graph minor

Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-01-12 16:30:06
87Graph theory / Mathematics / Discrete mathematics / Graph coloring / Graph / Clique / Randomized algorithm

Distributed Computing manuscript No. (will be inserted by the editor) Determining Majority in Networks with Local Interactions and very Small Local Memory George B. Mertzios · Sotiris E. Nikoletseas ·

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-06-12 12:30:49
88Graph theory / Graph coloring / Planar graph / Graph / Ear decomposition / Order theory / Interval edge coloring

Planar 4-critical graphs with four triangles Oleg V. Borodin ∗ Zdenˇek Dvoˇra´k † Alexandr V. Kostochka Bernard Lidick´ y§

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:59
89Graph theory / NP-complete problems / Circle graph / Intersection graph / Dominating set / Interval graph / Chordal graph / Graph coloring / Treewidth / Claw-free graph / Clique / Planar graph

TOCS9478_source.nohead.pdf

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-05-14 08:02:16
90Graph theory / Graph coloring / Girth / Graph minor / Tutte polynomial / Coxeter graph / Graph operations / Graph homomorphism / Book:Graph Theory I

Takehome Exam Graph II Start: :00 am End: :00 pm 1. Given a graph G whose girth is greater then 10 provide an algorithm that

Add to Reading List

Source URL: sharif.ir

Language: English - Date: 2016-01-25 15:19:56
UPDATE